Multi-Criteria Optimization in Answer Set Programming
نویسندگان
چکیده
We elaborate upon new strategies and heuristics for solving multi-criteria optimization problems via Answer Set Programming (ASP). In particular, we conceive a new solving algorithm, based on conflictdriven learning, allowing for non-uniform descents during optimization. We apply these techniques to solve realistic Linux package configuration problems. To this end, we describe the Linux package configuration tool aspcud and compare its performance with systems pursuing alternative approaches. 1998 ACM Subject Classification D.1.6 Logic Programming, I.2.3 Deduction and Theorem Proving, I.2.4 Knowledge Representation Formalisms and Methods
منابع مشابه
Using Genetic Algorithm in Solving Stochastic Programming for Multi-Objective Portfolio Selection in Tehran Stock Exchange
Investor decision making has always been affected by two factors: risk and returns. Considering risk, the investor expects an acceptable return on the investment decision horizon. Accordingly, defining goals and constraints for each investor can have unique prioritization. This paper develops several approaches to multi criteria portfolio optimization. The maximization of stock returns, the pow...
متن کاملMatchmaking with Answer Set Programming
Matchmaking is a form of scheduling that aims at bringing companies or people together that share common interests, services, or products in order to facilitate future business partnerships. We begin by furnishing a formal characterization of the corresponding multi-criteria optimization problem. We then address this problem by Answer Set Programming in order to solve real-world matchmaking ins...
متن کاملMulti-Criteria Optimization in ASP and its Application to Linux Package Configuration∗
We elaborate upon new strategies and heuristics for solving multi-criteria optimization problems via Answer Set Programming (ASP). In particular, we conceive a new solving algorithm, based on conflict-driven learning, allowing for non-uniform descents during optimization. We apply these techniques to solve realistic Linux package configuration problems, thereby showing how transparently such pr...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملStudy on multi-objective nonlinear programming in optimization of the rough interval constraints
This paper deals with multi- objective nonlinear programming problem having rough intervals in the constraints. The problem is approached by taking maximum value range and minimum value range inequalities as constraints conditions, reduces it into two classical multi-objective nonlinear programming problems, called lower and upper approximation problems. All of the lower and upper approximatio...
متن کامل